The TUM-Neuroimaging Center

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The TUM walking machines.

This paper presents some aspects of walking machine design with a special emphasis on the three machines MAX, MORITZ and JOHNNIE, having been developed at the Technical University of Munich within the last 20 years. The design of such machines is discussed as an iterative process improving the layout with every iteration. The control concepts are event-driven and follow logical rules, which hav...

متن کامل

Tum Def

nloaded ticular germ cell tumors (TGCT) originate from germ cells. The 129-Ter and M19 (129.MOLF-Chr19 mic) mouse strains have extremely high incidences of TGCTs. We found that the expression levels of coded splicing factor 1 (SF1) can modulate the incidence of TGCTs. We generated mice with inactivated null mice (Sf1−/−) died before birth. Mice with one intact allele of Sf1 (Sf1+/−) were viable...

متن کامل

The TUM-LDV HRTF Database

In this article a high resolution database of Head-Related Impulse Responses (HRIRs) and anthropometric parameters for 35 human subjects and two KEMAR manequins is introduced. The HRIRs were computed using Normalized Least Mean Square (NLMS) adaptive filtering. The NLMS method has no audible drawbacks compared to well-established HRIR estimation approaches (MLS and Exponetnial Sweep method) whi...

متن کامل

Tum Def Tes

Downlo ticular germ cell tumors (TGCT) originate from germ cells. The 129-Ter and M19 (129.MOLF-Chr19 mic) mouse strains have extremely high incidences of TGCTs. We found that the expression levels of coded splicing factor 1 (SF1) can modulate the incidence of TGCTs. We generated mice with inactivated null mice (Sf1−/−) died before birth. Mice with one intact allele of Sf1 (Sf1+/−) were viable ...

متن کامل

Tum Technische Universität München

We present an algorithm to generate a one-sided approximation of a given triangular mesh. We refer to such an approximate mesh as a bounding mesh, which includes the original mesh and has fewer vertices. Likewise, an inner bounding mesh is defined as an approximate mesh that is included by a given mesh. Our proposed bounding mesh algorithm performs iterative edge contractions and can generate b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Computational Neuroscience

سال: 2012

ISSN: 1662-5188

DOI: 10.3389/conf.fncom.2012.55.00016